Multiple input parsing and lexical analysis

نویسندگان

چکیده

This article introduces two new approaches in the areas of lexical analysis and context-free parsing. We present an extension, MGLL, generalised parsing which allows multiple input strings to be parsed together efficiently, we enhanced approach exploits this capability. The work provides power formal language specification disambiguation, brings techniques into historically well-studied syntax analysis. It encompasses character-level at one extreme classical LEX/YACC style division other, allowing advantages both approaches.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Learning in Lexical Analysis and Parsing

Lexical analysis and parsing tasks, modeling deeper properties of the words and their relationships to each other, typically involve word segmentation, part-ofspeech tagging and parsing. A typical characteristic of such tasks is that the outputs have structured. All of them can fall into three types of structured prediction problems: sequence segmentation, sequence labeling and parsing. In this...

متن کامل

Lexical Syntax and Parsing Architecture

and anonymous reviewers for helpful comments and discussion on earlier drafts of this manuscript. Thanks also are due our informants at Rutgers Center for Cognitive Science (RuCCS) and at the University of 1 Geneva for volunteering their time.

متن کامل

Strictly Lexical Dependency Parsing

We present a strictly lexical parsing model where all the parameters are based on the words. This model does not rely on part-of-speech tags or grammatical categories. It maximizes the conditional probability of the parse tree given the sentence. This is in contrast with most previous models that compute the joint probability of the parse tree and the sentence. Although the maximization of join...

متن کامل

Parsing Against Lexical Ambiguity

Marcus' original deterministic parsing included almost no part-of-speech ambiguity. In this paper, the addition of part-of-speech ambiguity to a deterministic parser written in Prolog is described. To handle this ambiguity, it was necessary to add no special mechanisms to the parser. Instead the grammar rules were made to enforce agreement, and reject ungrammatical sentences. The resulting syst...

متن کامل

Parsing Partially Bracketed Input

A method is proposed to convert a Context Free Grammar to a Bracket Context Free Grammar (BCFG). A BCFG is able to parse input strings which are, in part or whole, annotated with structural information (brackets). Parsing partially bracketed strings arises naturally in several cases. One interesting application is semi-automatic treebank construction. Another application is parsing of input str...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Programming Languages and Systems

سال: 2023

ISSN: ['1558-4593', '0164-0925']

DOI: https://doi.org/10.1145/3594734